Numerical semigroups generated by quadratic sequences
نویسندگان
چکیده
We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. find efficient algorithm for calculating the Apéry set, as well bounds on elements set. also Frobenius genus, asymptotic behavior genus. Finally, we embedding dimension all such semigroups.
منابع مشابه
On Numerical Semigroups Generated by Generalized Arithmetic Sequences
Given a numerical semigroup S, let M(S) = S \{0} and (lM(S)− lM(S)) = {x ∈ N0 : x + lM(S) ⊆ lM(S)}. Define associated numerical semigroups B(S) := (M(S)−M(S)) and L(S) := ∪l=1(lM(S)− lM(S)). Set B0(S) = S, and for i ≥ 1, define Bi(S) := B(Bi−1(S)). Similarly, set L0(S) = S, and for i ≥ 1, define Li(S) := L(Li−1(S)). These constructions define two finite ascending chains of numerical semigroups ...
متن کاملNumerical Semigroups Generated by Intervals
We study numerical semigroups generated by intervals and solve the following problems related to such semigroups: the membership problem, give an explicit formula for the Frobe-nius number, decide whether the semigroup is a complete intersection and/or symmetric, and computation of the cardi-nality of a (any) minimal presentation of this kind of numerical semigroups. A numerical semigroup is a ...
متن کاملAlmost Symmetric Numerical Semigroups Generated by Four Elements
In this paper, we study almost symmetric numerical semigroups generated by 4-elements. Rosales and Garćıa-Sánchez [RG2] proved that every almost symmetric numerical semigroup can be constructed by removing some minimal generators from an irreducible numerical semigroup with the same Frobenius number. Using this result, we concretely construct almost symmetric numerical semigroups generated by 4...
متن کاملSymmetric Numerical Semigroups Generated by Fibonacci and Lucas Triples
The symmetric numerical semigroups S (Fa, Fb, Fc) and S (Lk, Lm, Ln) generated by three Fibonacci (Fa, Fb, Fc) and Lucas (Lk, Lm, Ln) numbers are considered. Based on divisibility properties of the Fibonacci and Lucas numbers we establish necessary and sufficient conditions for both semigroups to be symmetric and calculate their Hilbert generating series, Frobenius numbers and genera.
متن کاملGroups and Semigroups Generated by Automata
In this dissertation we classify the metabelian groups arising from a restricted class of invertible synchronous automata over a binary alphabet. We give faithful, self-similar actions of Heisenberg groups and upper triangular matrix groups. We introduce a new class of semigroups given by a restricted class of asynchronous automata. We call these semigroups " expanding automaton semigroups ". W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2022
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-022-10263-9